An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
نویسندگان
چکیده
منابع مشابه
An Algorithm for Node-Disjoint Paths in Pancake Graphs
For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n − 1 internally disjoint paths connecting the nodes in the time complexity of polynomial order of n. The length of each path obtained and the time complexity of the algorithm are estimated theoretically and verified by computer simulation. key words: pancake graphs, node-to-node disjoint paths proble...
متن کاملAlgorithm for two disjoint long paths in 2-connected graphs
Denote by σ̄k = min {d(x1)+d(x2)+ · · ·+d(xk)−|N(x1)∩N(x2)∩· · ·∩N(xk)| | x1, x2, · · · , xk are k independent vertices in G}. Let n and m denote the number of vertices and edges of G. For any connected graph G, we give a polynomial algorithm in O(nm) time to either find two disjoint paths P1 and P2 such that |P1|+ |P2| ≥ min{σ̄4, n} or output G = ∪i=1Gi such that for any i, j ∈ {1, 2, ..., k} (k...
متن کاملShortest node-disjoint paths on random graphs
A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length ...
متن کاملFinding Disjoint Paths on Directed Acyclic Graphs
Given k + 1 pairs of vertices (s1, s2), (u1, v1), . . . , (uk, vk) of a directed acyclic graph, we show that a modified version of a data structure of Suurballe and Tarjan can output, for each pair (ul, vl) with 1 ≤ l ≤ k, a tuple (s1, t1, s2, t2) with {t1, t2} = {ul, vl} in constant time such that there are two disjoint paths p1, from s1 to t1, and p2, from s2 to t2, if such a tuple exists. Di...
متن کاملA Distributed Routing Protocol for Finding Two Node-Disjoint Paths in Computer Networks
In this paper we present a distributed routing protocol for finding two node-disjoint paths between each pair of nodes in a computer network. In the proposed protocol, each node in the network has the same procedure, which is driven by local information with respect to the network topology, such as adjacent nodes on a spanning tree in the network. Thus, the execution of the protocol can continu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2020
ISSN: 1330-1136,1846-3908
DOI: 10.20532/cit.2019.1004754